Toponogov comparison theorem for open triangles

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Thin Triangles and a Multiplicative Ergodic Theorem for Teichmüller Geometry

1.1. Overview. In this paper, we prove a curvature-type result about Teichmüller space, in the style of synthetic geometry. We show that, in the Teichmüller metric, “thin-framed triangles are thin”—that is, under suitable hypotheses, the variation of geodesics obeys a hyperbolic-like inequality. This theorem has applications to the study of random walks on Teichmüller space. In particular, an a...

متن کامل

Towards an Open System for Theorem Proving towards an Open System for Theorem Proving

In this contribution I advocate an open system for formalised mathematical reasoning that is able to capture diierent mathematical formalisms as well as a wide variety of proof formats. This is assumed to be much more adequate since it more closely reeects the situation in mathematics as a whole. In particular I try to classify diierent dimension according to which proofs can be classiied.

متن کامل

An Extension of the Fundamental Theorem on Right-angled Triangles

{3, 4, 5} is perhaps the most famous Pythagorean Triple with interest in such triples dating back many thousands of years to the ancient people of Mesopotamia. In this article, we shall consider such triples, with the restriction that the elements of these triples must not have any common factors they are Primitive Pythagorean Triples (PPTs). In particular, we shall consider the question of how...

متن کامل

A stability theorem on fractional covering of triangles by edges

Let ν(G) denote the maximum number of edge-disjoint triangles in a graph G and τ(G) denote the minimum total weight of a fractional covering of its triangles by edges. Krivelevich proved that τ(G) ≤ 2ν(G) for every graph G. This is sharp, since for the complete graphK4 we have ν(K4) = 1 and τ (K4) = 2. We refine this result by showing that if a graph G has τ(G) ≥ 2ν(G) − x, then G contains ν(G)...

متن کامل

Generalized monotone triangles – an extended combinatorial reciprocity theorem

In a recent work, the combinatorial interpretation of the polynomial α(n; k1, k2, . . . , kn) counting the number of Monotone Triangles with bottom row k1 < k2 < · · · < kn was extended to weakly decreasing sequences k1 ≥ k2 ≥ · · · ≥ kn. In this case the evaluation of the polynomial is equal to a signed enumeration of objects called Decreasing Monotone Triangles. In this paper we define Genera...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Tohoku Mathematical Journal

سال: 2011

ISSN: 0040-8735

DOI: 10.2748/tmj/1318338947